On Budgeted Optimization Problems
نویسنده
چکیده
In this paper we give a general method to solve budgeted optimization problems in strongly polynomial time. The method can be applied to several known budgeted problems and in addition we show two new applications. The first one extends Frederickson’s and Solis-Oba’s result [10] to (poly)matroid intersections from single matroids. The second one is the budgeted version of the minimum cost circulation problem.
منابع مشابه
Robust Combinatorial Optimization under Budgeted-Ellipsoidal Uncertainty∗
In the field of robust optimization uncertain data is modeled by uncertainty sets, i.e. sets which contain all relevant outcomes of the uncertain parameters. The complexity of the related robust problem depends strongly on the shape of the uncertainty set. Two popular classes of uncertainty are budgeted uncertainty and ellipsoidal uncertainty. In this paper we introduce a new uncertainty class ...
متن کاملRobust combinatorial optimization with cost uncertainty
We present in this paper a new model for robust combinatorial optimization with cost uncertainty that generalizes the classical budgeted uncertainty set. We suppose here that the budget of uncertainty is given by a function of the problem variables, yielding an uncertainty multifunction. The new model is less conservative than the classical model and approximates better Valueat-Risk objective f...
متن کاملRobust combinatorial optimization with variable budgeted uncertainty
Abstract: We introduce a new model for robust combinatorial optimization where the uncertain parameters belong to the image of multifunctions of the problem variables. In particular, we study the variable budgeted uncertainty, an extension of the budgeted uncertainty introduced by Bertsimas and Sim. Variable budgeted uncertainty can provide the same probabilistic guarantee as the budgeted uncer...
متن کاملBudgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
Many polynomial-time solvable combinatorial optimization problems become NP-hard if an additional complicating constraint is added to restrict the set of feasible solutions. In this paper, we consider two such problems, namely maximum-weight matching and maximumweight matroid intersection with one additional budget constraint. We present the first polynomial-time approximation schemes for these...
متن کاملRisk Budgeted Portfolio Optimization Using an Extended Ant Colony Optimization Metaheuristic
Risk Budgeted portfolio optimization problem centering on the twin objectives of maximizing expected portfolio return and minimizing portfolio risk and incorporating the risk budgeting investment strategy, turns complex for direct solving by classical methods triggering the need to look for metaheuristic solutions. This work explores the application of an extended Ant Colony Optimization algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2006